A unified approach to network location problems
نویسندگان
چکیده
منابع مشابه
A unified approach to network location problems
In this paper we introduce a new type of single facility location problems on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a nite dominating set for the optimal locations are developed. Also the extension to the multi-facility case is discussed.
متن کاملA unified approach to source location via rooted network augmentation
In Source Location (SL) problems the goal is to select a minimum cost source set S such that the connectivity from S to any node v is at least the demand dv of v. In Network Augmentation (NA) problems we are given a graph G = (V,E) and an edge-set F on V , edge-costs on F or node-costs on V , and connectivity requirements {rsv : sv ∈ D} on a set D of “demand edges”. The goal is to compute a min...
متن کاملHierarchical Facility Location and Hub Network Problems: A literature review
In this paper, a complete review of published researches about hierarchical facility location and hub network problems is presented. Hierarchical network is a system where facilities with different service levels interact in a top-down way or vice versa. In Hierarchical systems, service levels are composed of different facilities. Published papers from (1970) to (2015) have been studied and a c...
متن کاملA Holistic Approach Based on MCDM for Solving Location Problems
Location decision is an integral part of organizational strategies involving many factorsthat may be conflicting in nature. This paper presents a holistic approach of the multi-criteria decisionmaking (MCDM) methodology to select the optimal location(s), which fits best for both investors andmanagers. A case study is also provided to illustrate the application of the proposed holistic approach....
متن کاملA Unified Approach for Domination Problems on Different Network Topologies
We provide tight hardness results and approxiamation algorithms for many existing domination problems. We start with the positive influence dominating set (PIDS) problem, originated from the context of influence propagation in social networks. The PIDS problem seeks for a minimal set of nodes P such that all other nodes in the network have at least a fraction ρ > 0 of their neighbors in P; in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1999
ISSN: 0028-3045,1097-0037
DOI: 10.1002/(sici)1097-0037(199912)34:4<283::aid-net8>3.0.co;2-2